Papers with training-free algorithm
Position-Aware Depth Decay Decoding (D3): Boosting Large Language Model Inference Efficiency (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent dynamic computation methods show that not all components are required for inference, enabling a training-free pipeline. |
| Approach: | They propose a token-position aware layer skipping framework to save 1.5x times operations efficiently while maintaining performance. |
| Outcome: | The proposed algorithm achieves 1.5x speedup on large language models with no retraining and with comparable performance on the GSM8K and BBH benchmarks. |
BayesFlow: A Probability Inference Framework for Meta-Agent Assisted Workflow Generation (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable generality, often solving tasks with a single carefully engineered prompt. |
| Approach: | They propose to cast automatic workflow generation as Bayesian inference over a posterior distribution on workflows and instantiate BayesFlow as Bayer-based workflow generation framework. |
| Outcome: | The proposed framework improves accuracy by 9 percentage points over baselines and 65 percentage points on pool-wide benchmarks. |
Nudging: Inference-time Alignment of LLMs via Guided Decoding (2025.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) require alignment to effectively and safely follow user instructions. |
| Approach: | They propose a simple, training-free algorithm that aligns any base model at inference time using a small aligned model. |
| Outcome: | The proposed algorithm outperforms large aligned models on open-instruction tasks without training. |